منابع مشابه
Generating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs
We show that k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k. We also show that generating k-edge connected spanning subgraphs, where k is part of the input, can be done in incremental polynomial time. These results are based on properties of minimally k-connected graphs which might be of independent interest.
متن کاملGenerating Minimal k-Vertex Connected Spanning Subgraphs
We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
متن کاملApproximating Minimum-Size k-Connected Spanning Subgraphs via Matching
Abstract An e cient heuristic is presented for the problem of nding a minimum size k connected spanning subgraph of an undirected or directed simple graph G V E There are four versions of the problem and the approximation guarantees are as followsAn e cient heuristic is presented for the problem of nding a minimum size k connected spanning subgraph of an undirected or directed simple graph G V ...
متن کاملStrongly connected spanning subgraphs with the minimum number of arcs in semicomplete multipartite digraphs
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connected subgraph of a strongly connected digraph. This problem is NP-hard for general digraphs since it generalizes the hamiltonian cycle problem. We characterize the number of arcs in a minimum spanning strong subgraph for digraphs which are either extended semicomplete or semicomplete bipartite. Our ...
متن کاملPacking of 2-Connected Spanning Subgraphs and Spanning Trees
We prove that every (6k + 2`, 2k)-connected simple graph contains k rigid and ` connected edgedisjoint spanning subgraphs. This implies a theorem of Jackson and Jordán [4] and a theorem of Jordán [6] on packing of rigid spanning subgraphs. Both these results are generalizations of the classical result of Lovász and Yemini [9] saying that every 6-connected graph is rigid for which our approach p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1981
ISSN: 0095-8956
DOI: 10.1016/0095-8956(81)90087-3